Runtime Code Generation for Huffman Decoders
نویسنده
چکیده
Runtime code generation is not a new concept [1] and has been widely used for improving the performance of programs at runtime. Typical examples include Just-In-Time (JIT) compilation [2], [3] and dynamic optimization systems [4], [5]. A class of programs that can benefit from runtime code generation are programs with an execution path that is determined by runtime data, which remain unchanged during execution and their size is constant with regard to the total size of the input data. An example of such a program is a huffman decoder.
منابع مشابه
A Low-Cost Decoder for Arbitrary Binary Variable-Length Codes
Encoders and decoders for variable-length codes such as Huffman Codes can be costly to implement. This paper describes low-cost encoder and decoder for binary variable-length codes that is simple to implement when decoding speed is not an issue.
متن کاملHigh Speed Pipelined Parallel Huffman Decoding
This paper introduces a new class of Huffman decoders which is a developmet of the parallel Huffman decoder model. With pipelining and partitioning, a regular architecture with an arbitrary degree of pipelining is developed. The proposed architecture dramatically reduces the symbol decoder requirements compared to previous results, and still is the actual implementation of the symbol decoder no...
متن کاملNon binary huffman code pdf
A Method for the Construction of Minimum-Redundancy Codes PDF.HUFFMAN CODES. Corollary 28 Consider a coding from a length n vector of source symbols, x x1x2.xn, to a binary codeword of length lx. Then the.Correctness of the Huffman coding nitro pdf reader 32 bit 1 1 1 13 create pdf files algorithm. A binary code encodes each character as a binary. Code that encodes the file using as few bits as...
متن کاملIterative Source-Channel Decoding for Robust Image Transmission
In this paper we investigate iterative source-channel decoding for robust JPEG coded images transmission over noisy channels. Huffman codes used as the variable-length coding scheme in JPEG coding can be represented by an irregular trellis structure proposed by Balakirsky (1997). State transition probabilities can be derived from the irregular trellis and can be used as a priori information to ...
متن کاملAn Approach for Code Compression in Run Time for Embedded Systems - A Preliminary Results
Several factors are considered in the development of embedded systems, among which may be mentioned: physical size, weight, mobility, power consumption, memory, safety, all combined with a low cost and ease of use. There are several techniques to optimize the execution time and power consumption in embedded systems. One such technique is the code compression, the majority of existing proposals ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009